Topological Properties of the Directional Hypercube
نویسنده
چکیده
The directional hypercube (Dcube) which is a cost-effective variation of the traditional binary hypercube is introduced and analyzed in this paper. It employs directional (simple duplex) links only. The Dcube is defined and its key properties are derived including diameter, bandwidth, and connectivity. The diameter is at most 2 greater than that for a hypercube of the same size; the bandwidth is l/2 that of the hypercube; and the connectivity is optimal. The Dcube is shown to emulate the binary hypercube with at worst a factor of 4 degradation in time performance under any message distribution. A simple routing algorithm is demonstrated for the Dcube which requires only local information to route messages between nodes. Then, the concept of virtual channels has been added to the routing algorithm to make it deadlock-free. Keyworu’~: Fault tolerance; Parallel processing; Connectivity; Diameter; Node-disjoint path; Emulation; Routing
منابع مشابه
Hypercube Related Polytopes
Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.
متن کاملDual-cubes: a New Interconnection Network for High-performance Computer Clusters
The binary hypercube, or n-cube, has been widely used as the interconnection network in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. This paper introduces a new interconnection network for large-scale distributed memory multiprocessors called dual-...
متن کاملThe Multi-Directional Shuffle-Exchange Network: A Novel Topology for Regular Network Architectures
In this pape~ a novel class of network topologies known as the Multi-dimensional Shu@e-exchange Network (A4DSXN) is proposed. We show that the well-known de Bruijn graph and hypercube in fact both belong to the same class of graphs represented by MDSXN. The MDSXN is therefore the unification and generalization of the de Brutjn graph and hypercube. We show that members of MDSXN inherit the topol...
متن کاملPerformance Analysis of Massively Parallel Architectures
Cube based networks have received much attention over the past decade since they offer a rich interconnected structure with a number of desirable properties such as low diameter, high bisection width, lesser complexity and Cost. Among them the hypercube architecture is widely used network for parallel computer system due to its low diameter. The major drawback of hypercube based architectures i...
متن کاملThe Stretched Network: Properties, Routing, and Performance
In this paper, we study a class of interconnection networks for multiprocessors, called the Stretched-G network, which is based on a base graph G by replacing each edge of the base network with an array of processors. Two interesting features of the proposed topology are its area-efficient VLSI layout and superior scalability over the underlying base network while preserving most of its desirab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 53 شماره
صفحات -
تاریخ انتشار 1995